Solving the constrained p-center problem using heuristic algorithms

نویسندگان

  • Mansoor Davoodi Monfared
  • Ali Mohades
  • Jafar Rezaei
چکیده

The p-center problem is one of the location problems that have been studied in operations research and computational geometry. This paper describes a compatible discrete space version of the heuristic Voronoi diagram algorithm. Since the algorithm gets stuck in local optimums in some cases, we apply a number of changes in the body of the algorithm with regard to the geometry of the problem, in a way that it can reach the global optimum with a high probability. Finally, a comparison between the results of these two algorithms on several test problems and a real-world problem are presented. © 2011 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resource Constrained Project Scheduling with Material Ordering: Two Hybridized Meta-Heuristic Approaches (TECHNICAL NOTE)

Resource constrained project scheduling problem (RCPSP) is mainly investigated with the objective of either minimizing project makespan or maximizing project net present value. However, when material planning plays a key role in a project, the existing models cannot help determining material ordering plans to minimize material costs. In this paper, the RCPSP incorporated with the material order...

متن کامل

Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms

The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...

متن کامل

A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES

A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...

متن کامل

Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...

متن کامل

Solving Bi-objective Model of Hotel Revenue Management Considering Customer Choice Behavior Using Meta-heuristic Algorithms

The problem of maximizing the benefit from a specified number of a particular product with respect to the behavior of customer choices is regarded as revenue management. This managerial technique was first adopted by the airline industries before being widely used by many others such as hotel industries. The scope of this research is mainly focused on hotel revenue management, regarding which a...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Appl. Soft Comput.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2011